simplex lattice

См. также в других словарях:

• Simplex — For other uses, see Simplex (disambiguation). A regular 3 simplex or tetrahedron In geometry, a simplex (plural simplexes or simplices) is a generalization of the notion of a triangle or tetrahedron to arbitrary dimension. Specifically, an n… …   Wikipedia

• Convex lattice polytope — A convex lattice polytope (also called Z polyhedron or Z polytope) is a geometric object playing an important role in discrete geometry and combinatorial commutative algebra. It is a polytope in a Euclidean space Rn which is a convex hull of… …   Wikipedia

• E₈ lattice — In mathematics, the E8 lattice is a special lattice in R8. It can be characterized as the unique positive definite, even, unimodular lattice of rank 8. The name derives from the fact that it is the root lattice of the E8 root system. The normIn… …   Wikipedia

• Design Expert — Entwickler Stat Ease, Inc. Aktuelle Version 8.0.1 (2010) Betriebssystem Windows Kategorie Statistik Software Lizenz …   Deutsch Wikipedia

• 24-cell — Schlegel diagram (vertices and edges) Type Convex regular 4 polytope Schläfli symbol {3,4,3} t …   Wikipedia

• Hypercube — This article is about the mathematical concept. For the film, see Cube 2: Hypercube. Perspective projections Cube (3 cube) Tesseract (4 cube) In geometry, a hypercube is an n dimensional analogue of a …   Wikipedia

• Median graph — The median of three vertices in a median graph In mathematics, and more specifically graph theory, a median graph is an undirected graph in which any three vertices a, b, and c have a unique median: a vertex m(a,b,c) that belongs to shortest… …   Wikipedia

• Convex polytope — A 3 dimensional convex polytope A convex polytope is a special case of a polytope, having the additional property that it is also a convex set of points in the n dimensional space Rn.[1] Some authors use the terms convex polytope and convex… …   Wikipedia

• Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… …   Wikipedia

• Semiregular k 21 polytope — In geometry, a semiregular k21 polytope is a polytope in (k+4) dimensions constructed from the En Coxeter group, and having only regular polytope facets. The family was named by Coxeter as k21 by its bifurcating Coxeter Dynkin diagram, with a… …   Wikipedia

• Cuboctahedron — (Click here for rotating model) Type Archimedean solid Uniform polyhedron Elements F = 14, E = 24, V = 12 (χ = 2) Faces by sides 8{3}+6{4} …   Wikipedia